Augmented Interval List: a novel data structure for efficient genomic interval search
نویسندگان
چکیده
منابع مشابه
A Novel Distance Measure for Interval Data
Interval data is attracting attention from the data analysis community due to its ability to describe complex concepts. Since clustering is an important data analysis tool, extending these techniques to interval data is important. Applying traditional clustering methods on interval data loses information inherited in this particular data type. This paper proposes a novel dissimilarity measure w...
متن کاملA Novel Search Interval Forecasting Optimization Algorithm
In this paper, we propose a novel search interval forecasting (SIF) optimization algorithm for global numerical optimization. In the SIF algorithm, the information accumulated in the previous iteration of the evolution is utilized to forecast area where better optimization value can be located with the highest probability for the next searching operation. Five types of searching strategies are ...
متن کاملBinary Interval Search: a scalable algorithm for counting interval intersections
MOTIVATION The comparison of diverse genomic datasets is fundamental to understand genome biology. Researchers must explore many large datasets of genome intervals (e.g. genes, sequence alignments) to place their experimental results in a broader context and to make new discoveries. Relationships between genomic datasets are typically measured by identifying intervals that intersect, that is, t...
متن کاملCanonical Data Structure for Probe Interval Graphs
The class of probe interval graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition algorithms for the graph class are known. However, the complexity of the graph isomorphism problem for the class is still unknown. In this paper, extended MPQ-trees are proposed to represent the probe interval graphs. An...
متن کاملCanonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition algorithms for the graph class are known. However, the complexity of the graph isomorphism problem for the class is still unknown. In this paper, extended MPQ-trees are proposed to represent the interval probe graphs. An...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2019
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btz407